Improved layout structure with complexity measures for the Manufacturer’s Pallet Loading Problem (MPLP] using a Block approach
نویسندگان
چکیده
Purpose: The purpose of this paper is to study the Manufacturers pallet-loading problem (MPLP), by loading identical small boxes onto a rectangle pallet maximise utilization percentage while reducing Complexity loading.Design/methodology/approach: In research Block approach proposed using Mixed integer linear programming (MILP) model that generates layouts an improved structure, which very effective due its properties in grouping certain orientation along X and Y axis. Also, novel complexity index introduced compare for different loading, have same size but box arrangements.Findings: algorithm has been tested against available data-sets literature measure graphical layout results clearly demonstrate superiority compared with layouts.Originality/value: This aids real life manufactures operations when less complex are essential reduce loading.
منابع مشابه
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90 so long as they are placed with edges parallel to the pallet’s edges. The set of all PLP i...
متن کاملA Novel Model for Pallet Loading Problem Using Hybrid Optimization
A Pallet is a squared structure used for storage. As it has been produced over five million pallets a year, methodologies that reduce the storage cost are interesting. It is necessary to best allocate the items, which we‟ve used as boxes, to take the best advantage of the storage space. There are many possible allocations for a box on the pallet, and simply solve the problem can take a long tim...
متن کاملA Tree Search Algorithm for the Manufacturer’s Pallet Loading Problem
Transportation and warehouse costs are the two major components of the total logistics cost. To increase the material handling efficiency both in transit and in the warehouse, pallets have been used widely in logistics systems. The manufacturer’s pallet loading problem (MPLP) is to pack identical smaller boxes onto a rectangle pallet to maximize the pallet utilization. In this research, we solv...
متن کاملA branch-and-cut algorithm for the pallet loading problem
We propose a branch and cut algorithm for the Pallet Loading Problem. The 0-1 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maximum independent set problem to use the partial linear description of its associated polyhedron. F...
متن کاملA tabu search algorithm for the pallet loading problem
This paper presents a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet. The problem arises in distribution and logistics and has many practical applications. We have developed a tabu search algorithm based on new types of moves. Instead of moving individual boxes, we propose moving blocks, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering and Management
سال: 2021
ISSN: ['2013-8423', '2013-0953']
DOI: https://doi.org/10.3926/jiem.3264